Impossibility of Blind Signatures from One-Way Permutations
نویسندگان
چکیده
A seminal result in cryptography is that signature schemes can be constructed (in a black-box fashion) from any one-way function. The minimal assumptions needed to construct blind signature schemes, however, have remained unclear. Here, we rule out black-box constructions of blind signature schemes from one-way functions. In fact, we rule out constructions even from a random permutation oracle, and our results hold even for blind signature schemes for 1-bit messages that achieve security only against honest-but-curious behavior.
منابع مشابه
Delegatable Functional Signatures
We introduce delegatable functional signatures (DFS) which support the delegation of signingcapabilities to another party, called the evaluator, with respect to a functionality F . In a DFS,the signer of a message can choose an evaluator, specify how the evaluator can modify thesignature without voiding its validity, allow additional input and decide how the evaluator canfurther...
متن کاملPractical Round-Optimal Blind Signatures in the Standard Model
Round-optimal blind signatures are notoriously hard to construct in the standard model, especially in the malicious-signer model, where blindness must hold under adversarially chosen keys. This is substantiated by several impossibility results. The only construction that can be termed theoretically efficient, by Garg and Gupta (Eurocrypt’14), requires complexity leveraging, inducing an exponent...
متن کاملOn the (Im)possibility of Blind Message Authentication Codes
Blind signatures allow a signer to digitally sign a document without being able to glean any information about the document. In this paper, we investigate the symmetric analog of blind signatures, namely blind message authentication codes (blind MACs). One may hope to get the same efficiency gain from blind MAC constructions as is usually obtained when moving from asymmetric to symmetric crypto...
متن کاملOn the Impossibility of Basing Public-Coin One-Way Permutations on Trapdoor Permutations
One of the fundamental research themes in cryptography is to clarify what the minimal assumptions to realize various kinds of cryptographic primitives are, and up to now, a number of relationships among primitives have been investigated and established. Among others, it has been suggested (and sometimes explicitly claimed) that a family of one-way trapdoor permutations (TDP) is sufficient for c...
متن کاملSecurity of Blind Digital
Blind digital signatures were introduced by Chaum. In this paper, we show how security and blindness properties for blind digital signatures, can be simultaneously deened and satissed, assuming an arbitrary one-way trapdoor permutation family. Thus, this paper presents the rst complexity-based proof of security for blind signatures.
متن کامل